Inexact Half-Quadratic Optimization for Linear Inverse Problems
نویسندگان
چکیده
منابع مشابه
A New Inexact Inverse Subspace Iteration for Generalized Eigenvalue Problems
In this paper, we represent an inexact inverse subspace iteration method for computing a few eigenpairs of the generalized eigenvalue problem Ax = Bx [Q. Ye and P. Zhang, Inexact inverse subspace iteration for generalized eigenvalue problems, Linear Algebra and its Application, 434 (2011) 1697-1715 ]. In particular, the linear convergence property of the inverse subspace iteration is preserved.
متن کاملa new inexact inverse subspace iteration for generalized eigenvalue problems
in this paper, we represent an inexact inverse subspace iteration method for com- puting a few eigenpairs of the generalized eigenvalue problem ax = bx[q. ye and p. zhang, inexact inverse subspace iteration for generalized eigenvalue problems, linear algebra and its application, 434 (2011) 1697-1715 ]. in particular, the linear convergence property of the inverse subspace iteration is preserved.
متن کاملInexact Newton methods for inverse eigenvalue problems
In this paper, we survey some of the latest development in using inexact Newton-like methods for solving inverse eigenvalue problems. These methods require the solutions of nonsymmetric and large linear systems. One can solve the approximate Jacobian equation by iterative methods. However, iterative methods usually oversolve the problem in the sense that they require far more (inner) iterations...
متن کاملInexact Numerical Methods for Inverse Eigenvalue Problems
In this paper, we survey some of the latest development in using inexact Newton-like methods for solving inverse eigenvalue problems. These methods require the solutions of nonsymmetric and large linear systems. One can solve the approximate Jacobian equation by iterative methods. However, iterative methods usually oversolve the problem in the sense that they require far more (inner) iterations...
متن کاملHalf-quadratic transportation problems
We present a primal–dual memory efficient algorithm for solving a relaxed version of the general transportation problem. Our approach approximates the original cost function with a differentiable one that is solved as a sequence of weighted quadratic transportation problems. The new formulation allows us to solve differentiable, non– convex transportation problems.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: SIAM Journal on Imaging Sciences
سال: 2018
ISSN: 1936-4954
DOI: 10.1137/17m114635x